Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
نویسندگان
چکیده
In this paper we study several classes of Boolean formulae which generalize Horn formulae while preserving one of their main properties, namely the fact that satisfiability is decidable in polynomial time. We compare the known classes with respect to inclusion and define a hierarchy of new classes, which properly contains some of the known classes. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Horn renamability and hypergraphs
The satisfiability problem, SAT, consisting of testing the satisfiability of a propositional formula, is known to be NP-complete. On the other hand, several subclasses of propositional formulae are known, so that the restriction of SAT to such a subclass is solvable in polynomial time [7, 2] — among them Horn formulae [5] and formulae that are reducible toHorn, such as Horn-renamable formulae [...
متن کاملClasses of Boolean Formulae with Effectively Solvable SAT
We present an overview of known classes of Boolean formulae for which polynomial time algorithms for satisfiability testing (SAT) are known. We will summarize basic properties of these classes and their mutual relations with respect to inclusion. One of these classes on which we focus our attention in particular is the class of Single Lookahead Unit Resolution formulae (SLUR). We will define a ...
متن کاملFault Tolerant Boolean Satisfiability
A δ-model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yielding a new satisfying assignment. These satisfying assignments represent robust solutions to optimization problems (e.g., scheduling) where it is possible to recover from unforeseen events (e.g., a resource becoming...
متن کاملOn hierarchies over the SLUR class
SLUR is a class of the CNF formulae on which the single lookahead unit resolution algorithm for satisfiability (SAT) testing never fails. It is known that the SLUR class contains classes of Horn, hidden Horn, (hidden) extended Horn and balanced formulae as a subclass. In recent paper it was proven that the SLUR class contains all canonical formulae. In this paper we will extend this result by s...
متن کاملRecognition of q-Horn Formulae in Linear Time
The class of q-Horn Boolean expressions, generalizing the important classes of quadratic, Horn, and disguised Horn formulae, has been introduced in Boros et al. (1990). It has been shown there that the satisfiability problem corresponding to a disjunctive normal form CJ is solvable in time, linear in the size of 4, if C$ is known to be q-Horn. However, the recognition of such formulae was based...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 149 شماره
صفحات -
تاریخ انتشار 2005